Routes to Triviality
نویسندگان
چکیده
It is known that a number of inference principles can be used to trivialise the axioms of naı̈ve comprehension — the axioms underlying the naı̈ve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naı̈ve comprehension.
منابع مشابه
A remark on the numerical validation of triviality for scalar field theories using high-temperature expansions
We suggest a simple modification of the usual procedures of analysis for the high-temperature (strong-coupling or hopping-parameter) expansions of the renormalized four-point coupling constant in the ~ φ4 lattice scalar field theory. As a result we can more convincingly validate numerically the triviality of the continuum limit taken from the high temperature phase. There has been a steady accu...
متن کاملBlocking the Routes to Triviality with Depth Relevance
In Rogerson and Restall’s (J Philos Log 36, 2006, p. 435), the “class of implication formulas known to trivialize (NC)” (NC abbreviates “naïve comprehension”) is recorded. The aim of this paper is to show how to invalidate any member in this class by using “weak relevant model structures”. Weak relevant model structures verify deep relevant logics only.
متن کاملThe Strongest Possible Lewisian Triviality Result
David Lewis [8, 7] published several triviality results involving The Equation. Since then, several other authors have published similar triviality results (see, e.g., [5, 11]). In section two, I will explain the basic ideas behind all of these Lewisian triviality results. In section three, I will prove a new Lewisian triviality result. In fact, I will prove the strongest possible result of thi...
متن کاملTriviality Pursuit
The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas...
متن کاملHyperimmune-free degrees and Schnorr triviality
We investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Philosophical Logic
دوره 33 شماره
صفحات -
تاریخ انتشار 2004